On the Maximum Independent Set Problem in Subclasses of Planar Graphs
نویسندگان
چکیده
منابع مشابه
On the Maximum Independent Set Problem in Subclasses of Planar Graphs
The maximum independent set problem is known to be NP-hard in the class of planar graphs. In the present paper, we study its complexity in hereditary subclasses of planar graphs. In particular, by combining various techniques, we show that the problem is polynomially solvable in the class of S1,2,k-free planar graphs, generalizing several previously known results. S1,2,k is the graph consisting...
متن کاملThe Maximum Independent Set Problem in Subclasses of Subcubic Graphs
The Maximum Independent Set problem is NP-hard and remains NP-hard for graphs with maximum degree three (also called subcubic graphs). In our talk we will study its complexity in hereditary subclasses of subcubic graphs. Let A r q be the graph consisting of an induced cycle C q and an induced path with r edges having an endvertex in common with the C q , where A 1 4 is known as the banner. Our ...
متن کاملThe Maximum Independent Set Problem in Planar Graphs
We study the computational complexity of finding a maximum independent set of vertices in a planar graph. In general, this problem is known to be NP-hard. However, under certain restrictions it becomes polynomial-time solvable. We identify a graph parameter to which the complexity of the problem is sensible and produce a number of both negative (intractable) and positive (solvable in polynomial...
متن کاملOn the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
It is known that the maximum independent set problem is NP-complete for subcubic graphs, i.e. graphs of vertex degree at most 3. Moreover, the problem is NP-complete for 3-regular Hamiltonian graphs and for H-free subcubic graphs whenever H contains a connected component which is not a tree with at most 3 leaves. We show that if every connected component of H is a tree with at most 3 leaves and...
متن کاملThe Maximum Independent Set Problem in Subclasses of Si, j, k-Free Graphs
We consider the Maximum Independent Set (MIS) problem, which is known to be NP-hard in general, in subclasses of Si,j,k-free graphs, where Si,j,k is the graph consisting of three induced paths of lengths i, j, k with a common initial vertex. We revise the complexity of the problem. Then by two general approaches, augmenting graph and α-redundant vertex, some graph classes, for which we have pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2010
ISSN: 1526-1719
DOI: 10.7155/jgaa.00207